GPS和类GPS测距技术联合用于双星编队星座的状态确定

编队卫星状态的高精度确定是编队星座功能实现的重要基础。针对对地观测的双星编队星座的状态确定问题,为了提高状态确定的精度,在GPS技术的基础上,引入了类GPS测距技术,建立了联合GPS和类GPS测距技术进行状态整体确定的两种数学模型,并讨论了GPS星间单差模糊度和类GPS星内单差模糊度的同时初始化方法,最后进行了数值仿真。仿真结果显示,类GPS观测值尤其是类GPS星内载波单差观测值的引入,明显提高了双星编队星座的状态确定精度,其中绝对姿态角的精度达到rad,相对位置的精度达到m,相对钟差的精度达到s。仿真证明方法正确有效,模型二更优于模型一。     

北斗双星系统车辆定向技术

基于卫星载波相位干涉测量原理,研究了利用北斗双星系统确定车辆航向的相关技术。首先建立了北斗定向的数学模型;接着讨论了基于交换天线思想的等效转动基线极大/极小值ERMM模糊度确定方法;然后利用构建的双天线定向系统设计了车载实时航向确定实验,并通过高精度激光陀螺捷联惯导系统对航向确定精度进行了校核。实验结果验证了ERMM解模糊方法的有效性,表明定向系统实时航向确定有效精度可达0.62°。研究结果表明,北斗双星系统可以用于实时确定车辆的航向。     

功率循环下IGBT模块电热参数变化规律分析

为了分析IGBT模块老化过程中电热参数的变化规律,对IGBT模块进行了功率循环加速老化试验,并基于单脉冲测试方法在加速老化试验进程中每间隔1 000次功率循环,测取一次IGBT的结温、集电极电流与饱和压降三维关系曲面、开关能耗、热阻抗以及瞬态热阻抗曲线。IGBT模块老化失效时,其饱和压降、开通能耗、关断能耗以及热阻较其初始值分别增大了3.92%、12.05%、18.87%和22.65%,试验结果表明随着IGBT模块功率循环次数的增多,相同工作条件下IGBT饱和压降的增幅逐渐加大,而饱和压降、结温和集电极电流三者间的内在关系没有明显变化;IGBT瞬态热阻抗曲线暂态部分几乎不变,稳态部分向上移动的幅度逐渐加大;测取的IGBT模块电热参数中饱和压降增幅最小,开关能耗增幅较大,模块热阻的增幅最为明显。     

歧义容忍度图式理论与英语听力教学

"听"是语言交流的基础.当前,由于受传统教学模式的影响,学生的英语听说能力不强.提高学生的歧义容忍度,有效运用图式理论,强化阅读理解能力等教学方法是提高学生听力的有效途径.     

鱼雷寿命周期费用研究技术

随着技术的发展,寿命周期费用的研究正日益受到关注。评述了国内外寿命周期费用方面的研究现状,介绍了鱼雷寿命周期费用研究方法的内容及用途,探讨了费用估算的一般方法,在鱼雷寿命周期费用分解原则的基础上给出了鱼雷寿命周期费用分解结构,讨论了寿命周期费用研究方法急需解决的主要问题,并对其今后的发展方向做了展望。     

一类可逆多分子饱和反应系统的定性研究

研究了一类具有饱和输出的可逆多分子反应动力学模型 x=( y b) (δ-xyn cyn 1 ) y=( y b) yn(x-cy) -ay应用微分方程定性理论 ,较完整地解决了该系统极限环的存在性、唯一性及不存在性。     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

An integer programming model for the weekly tour scheduling problem

We study a workforce planning and scheduling problem in which weekly tours of agents must be designed. Our motivation for this study comes from a call center application where agents serve customers in response to incoming phone calls. Similar to many other applications in the services industry, the demand for service in call centers varies significantly within a day and among days of the week. In our model, a weekly tour of an agent consists of five daily shifts and two days off, where daily shifts within a tour may be different from each other. The starting times of any two consecutive shifts, however, may not differ by more than a specified bound. Furthermore, a tour must also satisfy constraints regarding the days off, for example, it may be required that one of the days off is on a weekend day. The objective is to determine a collection of weekly tours that satisfy the demand for agents' services, while minimizing the total labor cost of the workforce. We describe an integer programming model where a weekly tour is obtained by combining seven daily shift scheduling models and days‐off constraints in a network flow framework. The model is flexible and can accommodate different daily models with varying levels of detail. It readily handles different days‐off rules and constraints regarding start time differentials in consecutive days. Computational results are also presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 607–624, 2001.     

利用软件生命周期模型改进对软件系统的维护

软件维护一直被认为是软件产品交付后的过程,但实际上它贯穿于生命周期中每个阶段并不是一个独立阶段。文章针对软件维护对软件生命周期模型进行了重新定义;从模型的实现和可行性进行了详细地分析;并且强调了软件维护阶段是一个微型的开发周期,它开始于产品的某个维护请求,终于软件产品的退役;最后讨论了目前常用的维护方法(如再工程和逆向工程)在这个生命周期模型中的应用。     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010